дополнение нулями

English-Russian dictionary of computer science and programming. 2013.

### Смотреть что такое "zero padding" в других словарях:

• Padding — (von engl. to pad für auffüllen) ist ein Fachbegriff der Informatik für Fülldaten, mit denen ein vorhandener Datenbestand vergrößert wird. Die Füllbytes werden auch Pad Bytes genannt. Die für Prüfsummen verwendeten Daten zählen hierbei nicht zum… …   Deutsch Wikipedia

• Padding (cryptography) — In cryptography, padding refers to a number of distinct practices.Classical cryptographyOfficial messages often start and end in predictable ways: My dear ambassador, Weather report, Sincerely yours , etc. The primary use of padding with… …   Wikipedia

• F-Zero X — Infobox VG| title = F Zero X developer = Nintendo EAD publisher = Nintendo designer = Shigeru Miyamoto (producer)cite web | url=http://www.gamespot.com/n64/driving/fzero10/tech info.html | accessdate=2008 08 30 | publisher= GameSpot | title=F… …   Wikipedia

• Base64 — Numeral systems by culture Hindu Arabic numerals Western Arabic (Hindu numerals) Eastern Arabic Indian family Tamil Burmese Khmer Lao Mongolian Thai East Asian numerals Chinese Japanese Suzhou Korean Vietnamese …   Wikipedia

• Bluestein's FFT algorithm — (1968), commonly called the chirp z transform algorithm (1969), is a fast Fourier transform (FFT) algorithm that computes the discrete Fourier transform (DFT) of arbitrary sizes (including prime sizes) by re expressing the DFT as a convolution.… …   Wikipedia

• Rader's FFT algorithm — Rader s algorithm (1968) is a fast Fourier transform (FFT) algorithm that computes the discrete Fourier transform (DFT) of prime sizes by re expressing the DFT as a cyclic convolution. (The other algorithm for FFTs of prime sizes, Bluestein s… …   Wikipedia

• Ciphertext stealing — In cryptography, ciphertext stealing (CTS) is a general method of using a block cipher mode of operation that allows for processing of messages that are not evenly divisible into blocks without resulting in any expansion of the ciphertext, at the …   Wikipedia

• Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… …   Wikipedia

• Luhn algorithm — The Luhn algorithm or Luhn formula, also known as the modulus 10 or mod 10 algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier… …   Wikipedia

• The Cat Came Back — Infobox Standard title= The Cat Came Back comment= image size= caption=Cover, sheet music, 1893 writer=Harry S. Miller composer= lyricist= published= 1893 written= language=English form= original artist= recorded by= performed by= The Cat Came… …   Wikipedia

• Schnelle Faltung — Die Schnelle Faltung ist ein Algorithmus zur Berechnung der diskreten, aperiodischen Faltungsoperation mit Hilfe der schnellen Fourier Transformation (FFT). Dabei wird die rechenintensive aperiodische Faltungsoperation im Zeitbereich durch eine… …   Deutsch Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»